A decomposition relative to suns

&-fold Irreducible Decomposition of a Space Relative to a Mapping1

Supramolecular NanoStamping (SuNS)

When a useful device is developed, it always requires a mass-production technique to industrialize it. In the era of nano/biotechnology, the development of printing techniques has not followed the speed of the inventions of novel devices. One of the main challenges is handling at the same time the resolution and the chemical complexity of these nano/biodevices. Here a new stamping technique, Su...

Ranks of modules relative to a torsion theory

Relative to a hereditary torsion theory $tau$ we introduce a dimension for a module $M$, called {em $tau$-rank of} $M$, which coincides with the reduced rank of $M$ whenever $tau$ is the Goldie torsion theory. It is shown that the $tau$-rank of $M$ is measured by the length of certain decompositions of the $tau$-injective hull of $M$. Moreover, some relations between the $tau$-rank of $M$ and c...

Recursively Arbitrarily Vertex-decomposable Suns

A graph G = (V,E) is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to |V |, there is a sequence of vertex-disjoint subsets of V whose orders are given by τ , and which induce connected graphs. The aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This paper is a complement of [O. Baudon, F. Gilber...

Fast approximate convex decomposition using relative concavity

Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision dete...